A Data-Independent Distance to Infeasibility for Linear Conic Systems
نویسندگان
چکیده
منابع مشابه
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولInfeasibility Analysis for Linear Systems, a Survey
We discuss infeasibility analysis (study of changes needed to make an infeasible system feasible) for systems of linear constraints.
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولExact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...
متن کاملThe Structured Distance to Ill-Posedness for Conic Systems
Consider two finite-dimensional normed spaces X and Y , a fixed convex cone K ⊂ X, and a linear mapping A : X → Y . We call A well-posed if AK = Y . In particular, in the purely linear case K = X, well-posedness coincides with surjectivity. Our interest is in the “distance to ill-posedness”: that is, we seek the smallest structured linear perturbation ∆A : X → Y such that the perturbed mapping ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/18m1189464